Comparative Performance of Overlapping Connectivity Multiprocessor Interconnection Networks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of multiprocessor interconnection networks - Computer

w ith device characterist ics approaching physical limits, parallel or distributed processing has been widely advocated as a promising approach for building high performance computing systems. The continued impetus in research in these areas arises from two factors: (a) the technological development in the areaof VLSI chips and (b) the observation that significant exploitable software paralleli...

متن کامل

Multiprocessor Interconnection Networks

A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into grou...

متن کامل

Performance Analysis of Multiprocessor Mesh Interconnection Networks with Wormhole Routing

In this paper, we develop a fairly precise performance model for k-ary n-cube networks with single-flit or infinite buffers, and wormhole routing. The models include the deadlock-free routing scheme of Dally and Seitz in the finite-buffer case. In contrast to previous work, we model the system as a closed queueing network and (i) we include the effects of blocking and pipelining of messages in ...

متن کامل

On Bandwidth Capabilites of Multiprocessor Interconnection Networks

In this paper the general characteristics and bandwidth capabilities of Multiprocessor Interconnection Networks have been analyzed. We have examined some popular FT(Four Tree)[8],MFT(Modified Four Tree)[2],THN(Theta Network)[13],NFT(New Four Tree)[4], IFT(Improved Four Tree)[5], IASN(Irregular Augmented Shuffle Network)[14] and IIASN(Improved Irregular Augmented Shuffle Netwrok) [3] networks wh...

متن کامل

Power Constrained Design of Multiprocessor Interconnection Networks

[6] W. J. Dally, " Performance Analysis of k-ary n-cube interconnection networks, " IEEE Transactions on Computers, June 1990.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1991

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/34.3.207